Merging and splitting in cooperative games: some (im)possibility results

نویسندگان

  • Peter H. Knudsen
  • Lars Peter Østerdal
چکیده

Allocation rules for cooperative games can be manipulated by coalitions merging into single players, or, conversely, players splitting into a number of smaller units. This paper collects some (im)possibility results on mergingand splitting-proofness of (core) allocation rules for cooperative games with side-payments. JEL classification: C71, D23, D71.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cooperative Benefit and Cost Games under Fairness Concerns

Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...

متن کامل

Rationality, monotonicity and consistency in cooperative games: some (im)possibility results

On the domain of cooperative transferable utility games, we investigate if there are single valued solutions that reconcile rationality, consistency and monotonicity (with respect to the worth of the grand coalition) properties. This paper collects some impossibility results on the combination of core selection with either complement or projected consistency, and core selection, max consistency...

متن کامل

Pricing and Advertising Decisions in a Three-level Supply Chain with Nash, Stackelberg and Cooperative Games

Pricing and advertising are two important marketing strategies in the supply chain management which lead to customer demand’s increase and therefore higher profit for members of supply chains. This paper considers advertising, and pricing decisions simultaneously for a three-level supply chain with one supplier, one manufacturer and one retailer. The amount of market demand is influenced ...

متن کامل

False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time

False-name manipulation refers to the question of whether a player in a weighted voting game can increase her power by splitting into several players and distributing her weight among these false identities. Analogously to this splitting problem, the beneficial merging problem asks whether a coalition of players can increase their power in a weighted voting game by merging their weights. Aziz e...

متن کامل

Solving a Two-Period Cooperative Advertising Problem Using Dynamic Programming

Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2012